On Fence Patrolling by Mobile Agents
نویسندگان
چکیده
منابع مشابه
On Fence Patrolling by Mobile Agents
Suppose that a fence needs to be protected (perpetually) by k mobile agents with maximum speeds v1, . . . , vk so that no point on the fence is left unattended for more than a given amount of time. The problem is to determine if this requirement can be met, and if so, to design a suitable patrolling schedule for the agents. Alternatively, one would like to find a schedule that minimizes the idl...
متن کاملBoundary Patrolling by Mobile Agents with Distinct Maximal Speeds
A set of k mobile agents are placed on the boundary of a simply connected planar object represented by a cycle of unit length. Each agent has its own predefined maximal speed, and is capable of moving around this boundary without exceeding its maximal speed. The agents are required to protect the boundary from an intruder which attempts to penetrate to the interior of the object through a point...
متن کاملFence Patrolling with Two-speed Robots
A fence, represented by a unit interval is to be patrolled collectively by n robots. At any moment a robot may move in one of the two possible states: walking or patrolling. Each state is associated with a maximal moving speed which cannot be exceeded. A robot may have a unique pair of speeds, but its patrolling speed is always smaller than its walking speed. Each robot is allowed to patrol whi...
متن کاملFrequency-Based Multi-Robot Fence Patrolling
Patrolling—sometimes referred to as repeated coverage—is a task where points in a target work-area are repeatedly visited by robots. The patrolling algorithm can be optimized towards different performance criteria, such as frequency of point visits, minimization of travel time to arbitrary points of interest, etc. Most existing work provides patrolling solutions for closed-polygon work-areas, i...
متن کاملNegotiator Agents for the Patrolling Task
To visit specific locations on a map (graph) repeatedly To minimize node idleness (time lapse between two consecutive visits) To minimize the Average or Maximum graph idleness over a time interval 4 Motivation
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2014
ISSN: 1077-8926
DOI: 10.37236/4063